pointed pseudotriangulation造句
例句與造句
- Every planar Laman graph can be drawn as a pointed pseudotriangulation, although not every planar drawing of a planar Laman graph is a pseudotriangulation.
- Another way of finding a pointed pseudotriangulation is to " shell " a point set; that is, to remove convex hull vertices one by one until all points have been removed.
- Similarly, since any " k "-vertex subgraph of a pointed pseudotriangulation can be completed to form a pointed pseudotriangulation of its vertices, the subgraph must have at most 2 " k " " 3 edges.
- Similarly, since any " k "-vertex subgraph of a pointed pseudotriangulation can be completed to form a pointed pseudotriangulation of its vertices, the subgraph must have at most 2 " k " " 3 edges.
- A minimal pseudotriangulation with " n " vertices must have at least 2 " n " " 3 edges; if it has exactly 2 " n " " 3 edges, it must be a pointed pseudotriangulation, but there exist minimal pseudotriangulations with 3 " n " " O ( 1 ) edges.
- It's difficult to find pointed pseudotriangulation in a sentence. 用pointed pseudotriangulation造句挺難的